Derandomization that is rarely wrong from short advice that is typically goodGOLDREICH, Oded; WIGDERSON, Avi.Lecture notes in computer science. 2002, pp 209-223, issn 0302-9743, isbn 3-540-44147-6, 15 p.Conference Paper

Antirandomizing the wrong gameDOERR, Benjamin.Lecture notes in computer science. 2002, pp 876-887, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

On the derandomization of constant depth circuitsKLIVANS, Adam R.Lecture notes in computer science. 2001, pp 249-260, issn 0302-9743, isbn 3-540-42470-9Conference Paper

Derandomizing the HSSW Algorithm for 3-SATMAKINO, Kazuhisa; TAMAKI, Suguru; YAMAMOTO, Masaki et al.Algorithmica. 2013, Vol 67, Num 2, pp 112-124, issn 0178-4617, 13 p.Conference Paper

Improved derandomization of BPP using a hitting set generatorGOLDREICH, O; WIGDERSON, A.Lecture notes in computer science. 1999, pp 131-137, issn 0302-9743, isbn 3-540-66329-0Conference Paper

Hardness hypotheses, derandomization, and circuit complexityHITCHCOCK, John M; PAVAN, A.Lecture notes in computer science. 2004, pp 336-347, issn 0302-9743, isbn 3-540-24058-6, 12 p.Conference Paper

When worlds collide: Derandomization, lower bounds, and Kolmogorov complexityALLENDER, Eric.Lecture notes in computer science. 2001, pp 1-15, issn 0302-9743, isbn 3-540-43002-4Conference Paper

A 3-approximation algorithm for the k-level uncapacitated facility location problemAARDAL, K; CHUDAK, F. A; SHMOYS, D. B et al.Information processing letters. 1999, Vol 72, Num 5-6, pp 161-167, issn 0020-0190Article

A zero-one law for RP and derandomization of AM if NP is not smallIMPAGLIAZZO, Russell; MOSER, Philippe.Information and computation (Print). 2009, Vol 207, Num 7, pp 787-792, issn 0890-5401, 6 p.Article

Derandomization of PPSZ for unique-k-SATROLF, Daniel.Lecture notes in computer science. 2005, pp 216-225, issn 0302-9743, isbn 3-540-26276-8, 10 p.Conference Paper

The first-order isomorphism theoremAGRAWAL, Manindra.Lecture notes in computer science. 2001, pp 70-82, issn 0302-9743, isbn 3-540-43002-4Conference Paper

Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapsesKLIVANS, Adam R; VAN MELKEBEEK, Dieter.SIAM journal on computing (Print). 2002, Vol 31, Num 5, pp 1501-1526, issn 0097-5397, 26 p.Article

Irregularities of distribution, derandomization, and complexity theoryCHAZELLE, Bernard.Lecture notes in computer science. 2000, pp 46-54, issn 0302-9743, isbn 3-540-41413-4Conference Paper

Deterministic dictionariesHAGERUP, Torben; MILTERSEN, Peter Bro; PAGH, Rasmus et al.Journal of algorithms (Print). 2001, Vol 41, Num 1, pp 69-85, issn 0196-6774Article

Expected complexity of graph partitioning problemsKUCERA, L.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 193-212, issn 0166-218XConference Paper

Weighted fractional and integral k-matching in hypergraphsSRIVASTAV, A; STANGIER, P.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 255-269, issn 0166-218XConference Paper

A (2 + ε)-approximation algorithm for generalized preemptive open shop problem with minsum objectiveQUEYRANNE, Maurice; SVIRIDENKO, Maxim.Lecture notes in computer science. 2001, pp 361-369, issn 0302-9743, isbn 3-540-42225-0Conference Paper

Hard sets and pseudo-random generators for constant depth circuitsAGRAWAL, Manindra.Lecture notes in computer science. 2001, pp 58-69, issn 0302-9743, isbn 3-540-43002-4Conference Paper

Relations between average-case and worst-case complexityPAVAN, A; VINODCHANDRAN, N. V.Lecture notes in computer science. 2005, pp 422-432, issn 0302-9743, isbn 3-540-28193-2, 11 p.Conference Paper

Solvable group isomorphism is (almost) in NP ∩ coNPARVIND, V; TORAN, Jacobo.IEEE Conference on Computational Complexity. 2004, pp 91-103, isbn 0-7695-2120-7, 1Vol, 13 p.Conference Paper

A simpler and better derandomization of an approximation algorithm for single source rent-or-buyWILLIAMSON, David P; VAN ZUYLEN, Anke.Operations research letters. 2007, Vol 35, Num 6, pp 707-712, issn 0167-6377, 6 p.Article

Some results on derandomizationBUHRMAN, Harry; FORTNOW, Lance; PAVAN, A et al.Lecture notes in computer science. 2003, pp 212-222, issn 0302-9743, isbn 3-540-00623-0, 11 p.Conference Paper

Solving some discrepancy problems in NCMAHAJAN, S; RAMOS, E. A; SUBRAHMANYAM, K. V et al.Algorithmica. 2001, Vol 29, Num 3, pp 371-395, issn 0178-4617Article

EXPLICIT CONSTRUCTION OF A SMALL ∈-NET FOR LINEAR THRESHOLD FUNCTIONSRABANI, Yuval; SHPILKA, Amir.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3501-3520, issn 0097-5397, 20 p.Article

Generating randomized roundings with cardinality constraints and derandomizationsDOERR, Benjamin.Lecture notes in computer science. 2006, pp 571-583, issn 0302-9743, isbn 3-540-32301-5, 1Vol, 13 p.Conference Paper